Polynomial identities for 2×2 matrices with finite group actions
نویسندگان
چکیده
منابع مشابه
Invariants and polynomial identities for higher rank matrices
We exhibit explicit expressions, in terms of components, of discriminants, determinants, characteristic polynomials and polynomial identities for matrices of higher rank. We define permutation tensors and in term of them we construct discriminants and the determinant as the discriminant of order d, where d is the dimension of the matrix. The characteristic polynomials and the Cayley–Hamilton th...
متن کاملKnot polynomial identities and quantum group coincidences
We construct link invariants using the D2n subfactor planar algebras, and use these to prove new identities relating certain specializations of colored Jones polynomials to specializations of other quantum knot polynomials. These identities can also be explained by coincidences between small modular categories involving the even parts of the D2n planar algebras. We discuss the origins of these ...
متن کاملGroup actions on Hadamard matrices
Faculty of Arts Mathematics Department Master of Literature by Padraig Ó Catháin Hadamard matrices are an important item of study in combinatorial design theory. In this thesis, we explore the theory of cocyclic development of Hadamard matrices in terms of regular group actions on the expanded design. To this end a general theory of both group development and cocyclic development is formulated....
متن کاملEquivariant LS-category for finite group actions
In this paper we study the equivariant category of finite group actions. We introduce the basic filtration for the orbit space of the action. In terms of this filtration we give upper and lower estimates of the equivariant category. The idea for the proof is parallel to the approach in [3] for compact-Hausdorff foliations. We give examples to show that both the upper and lower bounds are realiz...
متن کاملPolynomial identities for partitions
For any partition λ of an integer n , we write λ =< 11, 22, . . . , nn > where mi(λ) is the number of parts equal to i . We denote by r(λ) the number of parts of λ (i.e. r(λ) = ∑n i=1mi(λ) ). Recall that the notation λ ` n means that λ is a partition of n . For 1 ≤ k ≤ N , let ek be the k-th elementary symmetric function in the variables x1, . . . , xN , let hk be the sum of all monomials of to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2004
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2003.08.010